Graph modification problems related to graph classes
نویسندگان
چکیده
i Acknowledgements The first person I need to thank is my supervisor Pinar Heggernes. Without her guidance, encouragement and scolding from time to time, this work would not exist. Thank you for taking me as your student, teaching me so much and believing in me from the very start. I have never told you how much this meant to me, but I hope this thesis can make up for at least some of it. These three years gave me the opportunity to fulfill many of my dreams, and for this I will always be thankful to you. Another person to whom I owe a lot for his unconditional help, even when he hardly knew me, is Marc Bezem. Your support has been critical in many occasions, including when I had to decide whether to apply for this PhD. Thank you for convincing me to do it, or I would have regretted it forever. I would like to thank also all my co-Tuy for making the two months at Rostock University extremely enjoyable for me and my family. If my PhD has been such a great experience, it is due mostly to all my colleagues at the Algorithms Group. I would like to thank in particular Alexey for all the fun time we spent together fishing, hiking, drinking or talking just about anything. All of this before we both got married of course.... Joanna, thanks for never letting things get boring, and Morten, one day we will catch that giant cod, I promise. A special thank to Yngve, who is always there with a reasonable answer to practically any question one could think about. Maybe too many stupid questions are also the reason why he moved out of our office, but thanks to this I could get a very thoughtful new office mate. Daniel thanks for always making sure that I do not work too much, and Saket, thank you for keeping Daniel out of the office. Serge, Rodica and Daniel, thanks to you too for being around and help me whenever I needed it. I also want to thank my parents for always supporting my choices and making sure that I have everything I need, despite the distance that separates us. Finally I want to dedicate this work to my lovely wife Hilde and our beautiful son Alessandro. Hilde, thanks for taking care of Alessandro on your own while I …
منابع مشابه
An Effective Method for Utility Preserving Social Network Graph Anonymization Based on Mathematical Modeling
In recent years, privacy concerns about social network graph data publishing has increased due to the widespread use of such data for research purposes. This paper addresses the problem of identity disclosure risk of a node assuming that the adversary identifies one of its immediate neighbors in the published data. The related anonymity level of a graph is formulated and a mathematical model is...
متن کاملON NEW CLASSES OF MULTICONE GRAPHS DETERMINED BY THEIR SPECTRUMS
A multicone graph is defined to be join of a clique and a regular graph. A graph $ G $ is cospectral with graph $ H $ if their adjacency matrices have the same eigenvalues. A graph $ G $ is said to be determined by its spectrum or DS for short, if for any graph $ H $ with $ Spec(G)=Spec(H)$, we conclude that $ G $ is isomorphic to $ H $. In this paper, we present new classes of multicone graphs...
متن کاملOn the Regular Power Graph on the Conjugacy Classes of Finite Groups
emph{The (undirected) power graph on the conjugacy classes} $mathcal{P_C}(G)$ of a group $G$ is a simple graph in which the vertices are the conjugacy classes of $G$ and two distinct vertices $C$ and $C'$ are adjacent in $mathcal{P_C}(G)$ if one is a subset of a power of the other. In this paper, we describe groups whose associated graphs are $k$-regular for $k=5,6$.
متن کاملThe Merrifield-Simmons indices and Hosoya indices of some classes of cartesian graph product
The Merrifield-Simmons index of a graph is defined as the total number of the independent sets of the graph and the Hosoya index of a graph is defined as the total number of the matchings of the graph. In this paper, we give formula for Merrifield-Simmons and Hosoya indices of some classes of cartesian product of two graphs K{_2}×H, where H is a path graph P{_n}, cyclic graph C{_n}, or star gra...
متن کاملThe graph of equivalence classes and Isoclinism of groups
Let $G$ be a non-abelian group and let $Gamma(G)$ be the non-commuting graph of $G$. In this paper we define an equivalence relation $sim$ on the set of $V(Gamma(G))=Gsetminus Z(G)$ by taking $xsim y$ if and only if $N(x)=N(y)$, where $ N(x)={uin G | x textrm{ and } u textrm{ are adjacent in }Gamma(G)}$ is the open neighborhood of $x$ in $Gamma(G)$. We introduce a new graph determined ...
متن کاملOn the Maximum Number of Dominating Classes in Graph Coloring
In this paper we investigate the dominating- -color number، of a graph G. That is the maximum number of color classes that are also dominating when G is colored using colors. We show that where is the join of G and H. This result allows us to construct classes of graphs such that and thus provide some information regarding two questions raised in [1] and [2].
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008